The Hebrew University of Jerusalem Secretary Problem of Minimizing Expected Rank: a Simple Suboptimal Approach with Generalizations

The secretary problem for selecting one item so as to minimize its expected rank, based on observing the relative ranks only, is revisited. A simple suboptimal rule, which performs almost as well as the optimal rule, is given. The rule stops with the smallest i such that Ri ≤ ic/(n + 1 − i) for a given constant c, where Ri is the relative rank of the i observation, and n is the total number of items. This rule has added flexibility. i) A curtailed version thereof can be used to select an item with a given probability P , P < 1. ii) The rule can be used to select two or more items. The problem of selecting a fixed proportion, α, 0 < α < 1, of n, is also treated. Numerical results are included to illustrate the findings. 2000 Mathematical Subject Classification: Primary 62L99 ; Secondary 62F07; 60F15; 60F15.